Modied Cyclic Algo- Rithms for Solving Triangular Systems on Distributed-memory Multiprocessors, Siam Complexity of Dense-linear-system Solution on a Multi- Processor Ring
نویسندگان
چکیده
We describe an e ort to implement the LINPACK Benchmark on two massively parallel distributed memory MIMD computers, the Intel iPSC/860 and DELTA Systems.
منابع مشابه
Parallel Cyclic Wavefront Algorithms for Solving Semidefinite Lyapunov Equations
In this paper we describe new parallel cyclic wavefront algo rithms for solving the semide nite discrete time Lyapunov equation for the Cholesky factor using Hammarling s method by the message passing para digm These algorithms are based on previous cyclic and modi ed cyclic algorithms designed for the parallel solution of triangular linear systems The experimental results obtained on an SGI Po...
متن کاملParallel Solution of Sparse Linear Least Squares Problemson Distributed - Memory
This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...
متن کاملParallel Solution of Sparse Linear Least Squares Problems on Distributed-Memory Multiprocessors
This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...
متن کاملNew Data Distribution for Solving Triangular Systems on Distributed Memory Machines
The aim is to present a new data distribution of triangular matrices that provides steady distribution of blocks among processes and reduces memory wasting compared to the standard block-cyclic data layout used in the ScaLAPACK library for dense matrix computations. A new algorithm for solving triangular systems of linear equations is also introduced. The results of experiments performed on a c...
متن کاملAn efficient multi-core implementation of a novel HSS-structured multifrontal solver using randomized sampling
We present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination, and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with i...
متن کامل